Parsing and Disambiguation of Symbolic Mathematics in the Naproche System

نویسندگان

  • Marcos Cramer
  • Peter Koepke
  • Bernhard Schröder
چکیده

The Naproche system is a system for linguistically analysing and proof-checking mathematical texts written in a controlled natural language. The aim is to have an input language that is as close as possible to the language that mathematicians actually use when writing textbooks or papers. Mathematical texts consist of a combination of natural language and symbolic mathematics, with symbolic mathematics obeying its own syntactic rules. We discuss the difficulties that a program for parsing and disambiguating symbolic mathematics must face and present how these difficulties have been tackled in the Naproche system. One of these difficulties is the fact that information provided in the preceding context – including information provided in natural language – can influence the way a symbolic expression has to be disambiguated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Naproche System

The Naproche project (Natural language Proof Checking) was initiated by Bernhard Schröder and Peter Koepke at the University of Bonn to focus on an interdisciplinary study of the semi-formal language of mathematics. A central goal of Naproche is to develop a controlled natural language (CNL) for mathematical texts and adapted proof checking software which checks texts written in the CNL for syn...

متن کامل

Interpreting Plurals in the Naproche CNL

The Naproche CNL [2] is a controlled natural language for mathematical texts, i.e. a controlled subset of the semi-formal language of mathematics (SFLM) as used in mathematical journals and textbooks. The Naproche system translates Naproche CNL texts first into Proof Representation Structures (PRSs, [2]), an adapted version of Discourse Representation Structures, which are further translated in...

متن کامل

برچسب‌زنی خودکار نقش‌های معنایی در جملات فارسی به کمک درخت‌های وابستگی

Automatic identification of words with semantic roles (such as Agent, Patient, Source, etc.) in sentences and attaching correct semantic roles to them, may lead to improvement in many natural language processing tasks including information extraction, question answering, text summarization and machine translation. Semantic role labeling systems usually take advantage of syntactic parsing and th...

متن کامل

The Naproche Project: Controlled Natural Language Proof Checking of Mathematical Texts

The Naproche project (NAtural language PROof CHEcking) studies the semiformal language of mathematics (SFLM) as used in journals and textbooks from the perspectives of linguistics, logic and mathematics. A central goal of Naproche is to develop and implement a controlled natural language (CNL) for mathematical texts which can be transformed automatically into equivalent first order formulas by ...

متن کامل

APPLICATION OF EXP-FUNCTION METHOD TO THE (2+1)-DIMENSIONAL CALOGERO BOGOYAVLANSKII SCHIFF EQUATION

In this paper, the Exp-function method, with the aid of a symbolic computation system such as Maple, is applied to the (2+1) -dimensional Calogero Bogoyavlanskii Schiff equation. Exact and explicit generalized solitary solutions are obtained in more general forms. The free parameters can be determined by initial or boundary conditions. The method is straightforward and concise, and its applicat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011